Genus distribution of P3□Pn
نویسندگان
چکیده
We derive a recursion for the genus distribution of the graph family P32Pn, with the aid of a modified collection of double-root partials. We introduce a new kind of production, which corresponds to a surgical operation more complicated than the vertexor edge-amalgamation operations used in our earlier work.
منابع مشابه
On the Noether-Lefschetz Theorem and Some Remarks on Codimension-two Cycles
Here, "of general moduli" means that there is a countable union V of subvarieties of the space pN of surfaces of degree d in p3, such that the statement Pie(S) = Z holds for S ~ p N _ V. Noether, it would seem, stated this theorem but never completely proved it. Instead, he gave a plausibility argument, based on the following construction 1 : let ,~.g be the Hilbert scheme of curves of degree n...
متن کاملAnthocyanins in flowers of genus Rosa, sections Cinnamomeae (=Rosa), Chinenses, Gallicanae and some modern garden roses.
Forty-four taxa of three sections (Cinnamomeae (=Rosa) 26, Chinenses 8 and Gallicanae 10) and eight modern garden roses in the genus Rosa were surveyed for their floral anthocyanins. Eleven anthocyanins: 3-glucosides and 3,5-diglucosides of cyanidin (Cy), pelargonidin (Pg) and peonidin (Pn), 3-rutinosides and 3-rho-coumaroylglucoside-5-glucosides of Cy and Pn, and Cy 3-sophoroside, were isolate...
متن کاملBondage number of mesh networks
The bondage number b(G) of a nonempty graph G is the smallest number of edges whose removal from G results in a graph with domination number greater than that of G. Denote Pn × Pm the Cartesian product of two paths Pn and Pm. This paper determines the exact values of b(Pn × P2), b(Pn × P3), and b(Pn × P4) for n 2.
متن کاملAN IRREDUCIBLE HEEGAARD DIAGRAM OF THE REAL PROJECTIVE 3-SPACE P3 YOUNG HO IM and SOO
We give a genus 3 Heegaard diagram H of the real projective space P3, which has no waves and pairs of complementary handles. So Negami’s result that every genus 2 Heegaard diagram of P3 is reducible cannot be extended to Heegaard diagrams of P3 with genus 3.
متن کاملThe sum choice number of P3 Pn
A graph G is said to be f -choosable if there exists a proper coloring from every assignment of lists of colors to the vertices of G where the list sizes are given by f . The sum choice number of G is the minimum ∑ v∈V (G) f(v) over all f such that G is f -choosable. Here we determine the sum choice of the cartesian product P3 Pn to be 8n − 3 − bn/3c. The techniques used here have applicability...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 312 شماره
صفحات -
تاریخ انتشار 2012